Specifying Various Time Models with Temporal Propositional Variables in Duration Calculus
نویسنده
چکیده
Many extensions of Duration Calculus (DC) have been proposed for handling different aspects of real-time systems. For each extension several different semantics are defined for different time structures which are suitable for different applications and achieve low complexity for the decidability of some properties. Hence, different proof systems have to be developed for reasoning in different calculi. We demonstrate that with temporal propositional letters, many useful time structures and operators can be completely described in the original DC with continuous time. Hence, we can use the proof system for original DC and the specification of the specific time structure to reason in that time structure without the need of introducing a new calculus. Dang Van Hung is a research fellow for the research project “Theories and Design Methods for Real-time Systems” since October 1995 being on leave of absence from Institute of Information Technology, Nghia Do, Cau Giay, Hanoi, Vietnam. He has a PhD (equivalent) degree in Computer Science (concurrent systems) in 1988, Computer and Automation Research Institute (SZTAKI), Hungarian Academy of Sciences, Budapest, Hungary, and a BSc degree in Mathematics (numerical methods) in 1977, Hanoi University, Hanoi, Vietnam. His research interests include Formal Techniques of Programming, Concurrent and Distributed Computing, Design Techniques for Real-Time systems. e-mail: [email protected] Copyright c © 2007 by UNU-IIST
منابع مشابه
Object - Oriented Conceptual Modeling of Video
In this paper, we propose a graphical data model for specifying spatio-temporal semantics of video data. The proposed model segments a video clip into sub-segments consisting of objects. Each object is detected and recognized, and the relevant information of each object is recorded. The motions of objects are modeled through their relative spatial relationships as time evolves. Based on the sem...
متن کاملPropositional Scopes in Linear Temporal Logic
In this paper, we address the problem of specifying a property in LTL over a subset of the states of a system under test, ignoring the rest of the states. A modern LTL semantics that applies for both finite and infinite traces is considered. We introduce specialized operators (syntax and semantic) that help specifying properties over propositional scopes, where each scope constitute a subset of...
متن کاملA Simpler Formulation of Natural Deduction Calculus for Linear-Time Temporal Logic
We present a natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. The system extends the natural deduction construction of the classical propositional logic. This will open the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various AI applications.
متن کاملModelling History-Dependent Business Processes
Choices in business processes are often based on the process history saved as a log-file listing events and their time stamps. In this paper we introduce a finite-path variant of the timed propositional logics with past for specifying guards in business process models. The novelty is due to the introduction of boundary points start and now corresponding to the starting and current observation p...
متن کاملMonodic temporal logic with quantified propositional variables
We extend the monodic fragment of first-order linear temporal logic to include right-linear grammar operators and quantification of propositional variables. Unlike propositional temporal logic, the use of grammar operators in first-order temporal logic is not equivalent to general propositional quantification, as the latter admit satisfiable formulae without countable models. We consider the de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007